NP-hard problems

Results: 67



#Item
21358 Int. J. Bio-Inspired Computation, Vol. 3, No. 6, 2011 Wisdom of artificial crowds algorithm for solving NP-hard problems

358 Int. J. Bio-Inspired Computation, Vol. 3, No. 6, 2011 Wisdom of artificial crowds algorithm for solving NP-hard problems

Add to Reading List

Source URL: cecs.louisville.edu

Language: English - Date: 2015-09-21 11:15:09
    22Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied

    Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied

    Add to Reading List

    Source URL: www.piercelab.caltech.edu

    Language: English - Date: 2010-09-08 02:56:32
    23Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions

    Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions

    Add to Reading List

    Source URL: cognitiveharmony.net

    Language: English - Date: 2008-09-30 17:00:23
    24Approximation schemes for NP-hard geometric optimization problems: A survey Sanjeev Arora∗ Princeton University NP-hard geometric optimization problems arise in many disciplines. Perhaps the most famous one is the tra

    Approximation schemes for NP-hard geometric optimization problems: A survey Sanjeev Arora∗ Princeton University NP-hard geometric optimization problems arise in many disciplines. Perhaps the most famous one is the tra

    Add to Reading List

    Source URL: www.cs.duke.edu

    - Date: 2007-04-04 18:30:18
      25CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID:

      CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID:

      Add to Reading List

      Source URL: web.engr.illinois.edu

      Language: English - Date: 2014-12-28 08:48:14
      26CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID:

      CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID:

      Add to Reading List

      Source URL: web.engr.illinois.edu

      Language: English - Date: 2014-12-28 08:52:35
      27Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology

      Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology

      Add to Reading List

      Source URL: www.inf.kcl.ac.uk

      Language: English - Date: 2013-06-09 11:47:58
      28On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk

      On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk

      Add to Reading List

      Source URL: arxiv.org

      Language: English - Date: 2014-03-27 21:09:14
      29CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi†

      CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi†

      Add to Reading List

      Source URL: 2011.cccg.ca

      Language: English - Date: 2011-08-15 18:22:15
      30Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1

      Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1

      Add to Reading List

      Source URL: www.mrfellows.net

      Language: English - Date: 2009-10-05 20:05:44